Limit shape and height fluctuations of random perfect matchings on square-hexagon lattices
نویسندگان
چکیده
We study perfect matchings on the contracting square-hexagon lattice, constructed row by either from a of square grid or hexagonal lattice. Given 1×n periodic weights to edges, we consider probabilities dimers proportional product edge weights. show that partition function equals Schur then prove Law Large Numbers (limit shape) and Central Limit Theorem (convergence Gaussian free field) for corresponding height functions. also certain types near turning corner converge in distribution eigenvalues Unitary Ensemble, scaling limit when each segment bottom boundary grows linearly with respect dimension graph, frozen is cloud curve multiple tangent points (depending period) along horizontal segment.
منابع مشابه
Sampling Weighted Perfect Matchings on the Square-Octagon Lattice
We consider perfect matchings of the square-octagon lattice, also known as “fortresses” [16]. There is a natural local Markov chain on the set of perfect matchings that is known to be ergodic. However, unlike Markov chains for sampling perfect matchings on the square and hexagonal lattices, corresponding to domino and lozenge tilings, respectively, the seemingly related Markov chain on the squa...
متن کاملCones, lattices and Hilbert bases of circuits and perfect matchings
There have been a number of results and conjectures regarding the cone, the lattice and the integer cone generated by the (real-valued characteristic functions of) circuits in a binary matroid. In all three cases, one easily formulates necessary conditions for a weight vector to belong to the set in question. Families of matroids for which such necessary conditions are suucient have been determ...
متن کاملOn Perfect Matchings and Hamiltonian Cycles in Sumsof Random
We prove that the sum of two random trees almost surely possesses a perfect matching and the sum of ve random trees almost surely possesses a Hamiltonian cycle.
متن کاملOn the Number of Perfect Matchings in Random Lifts
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint) and replacing each edge by a randomly chosen perfect matching between the n-sets corresponding to the endpoints of the edge. Let XG be the number of perfect matchings in a random lift of G. We study the distribution o...
متن کاملPerfect matchings in random uniform hypergraphs
In the random k-uniform hypergraph Hk(n, p) on a vertex set V of size n, each subset of size k of V independently belongs to it with probability p. Motivated by a theorem of Erdős and Rényi [6] regarding when a random graph G(n, p) = H2(n, p) has a perfect matching, Schmidt and Shamir [14] essentially conjectured the following. Conjecture Let k|n for fixed k ≥ 3, and the expected degree d(n, p)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Fourier
سال: 2022
ISSN: ['0373-0956', '1777-5310']
DOI: https://doi.org/10.5802/aif.3442